Repairing Ontologies for Incomplete Reasoners

نویسندگان

  • Giorgos Stoilos
  • Bernardo Cuenca Grau
  • Boris Motik
  • Ian Horrocks
چکیده

The need for scalable query answering often forces Semantic Web applications to use incomplete OWL 2 reasoners, which in some cases fail to derive all answers to a query. This is clearly undesirable, and in some applications may even be unacceptable. To address this problem, we investigate the problem of ‘repairing’ an ontology T —that is, computing an ontology R such that a reasoner that is incomplete for T becomes complete when used with T ∪R. We identify conditions on T and the reasoner that make this possible, present a practical algorithm for computing R, and present a preliminary evaluation which shows that, in some realistic cases, repairs are feasible to compute, reasonable in size, and do not significantly affect reasoner performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repairing Incomplete Reasoners

The pressing need for scalable query answering has motivated the development of many incomplete ontology-based reasoners. Improving the completeness of such systems without sacrificing their favourable performance would be beneficial to many applications. In this paper, we address the following problem: given a query q, a TBox T and an incomplete reasoner ans (i.e., one that accepts q and T as ...

متن کامل

RaDON - Repair and Diagnosis in Ontology Networks

One of the major challenges in managing networked and dynamic ontologies is to handle inconsistencies in single ontologies, and inconsistencies introduced by integrating multiple distributed ontologies. Our RaDON system provides functionalities to repair and diagnose ontology networks by extending the capabilities of existing reasoners. The system integrates several new debugging and repairing ...

متن کامل

Completeness Guarantees for Incomplete Reasoners

We extend our recent work on evaluating incomplete reasoners by introducing strict testing bases. We show how they can be used in practice to identify ontologies and queries where applications can exploit highly scalable incomplete query answering systems while enjoying completeness guarantees normally available only when using computationally intensive reasoning systems.

متن کامل

Complete Classification of Complex ALCHO Ontologies Using a Hybrid Reasoning Approach

Consequence-based reasoners are typically significantly faster than tableau-based reasoners for ontology classification. However, for more expressive DL languages like ALCHO, consequence-based reasoners are not applicable, but tableau-based reasoners can sometimes require an unacceptably long time for large and complex ontologies. This paper presents a weakening and strengthening approach for c...

متن کامل

A System for Debugging Missing Is-a Structure in EL Ontologies

With the increased use of ontologies in semantically-enabled applications, the issue of debugging defects in ontologies has become increasingly important. These defects can lead to wrong or incomplete results for the semanticallyenabled applications. Debugging consists of the phases of detection and repairing. In this paper we introduce a system for repairing a particular kind of defects, i.e. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011